A Computability-theoretic Reformulation of the Connes Embedding Problem
نویسنده
چکیده
The Connes Embedding Problem (CEP) asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the computability of the universal theory of every type II1 von Neumann algebra. We also derive some further computability-theoretic consequences of the CEP.
منابع مشابه
Computability and the Connes Embedding Problem
The Connes Embedding Problem (CEP) asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the statement that every type II1 tracial von Neumann algebra has a computable universal theory.
متن کاملAlgebraic reformulation of Connes embedding problem and the free group algebra
We give a modification of I. Klep and M. Schweighofer algebraic reformulation of Connes’ embedding problem by considering ∗-algebra of the countably generated free group. This allows to consider only quadratic polynomials in unitary generators instead of arbitrary polynomials in self-adjoint generators.
متن کاملCorrection of a Proof in ”connes’ Embedding Conjecture and Sums of Hermitian Squares”
We show that Connes’ embedding conjecture (CEC) is equivalent to a real version of the same (RCEC). Moreover, we show that RCEC is equivalent to a real, purely algebraic statement concerning trace positive polynomials. This purely algebraic reformulation of CEC had previously been given in both a real and a complex version in a paper of the last two authors. The second author discovered a gap i...
متن کاملA Gentle Introduction to Von Neumann Algebras for Model Theorists
1. Topologies on B(H) and the double commutant theorem 2 2. Examples of von Neumann algebras 5 2.1. Abelian von Neumann algebras 6 2.2. Group von Neumann algebras and representation theory 6 2.3. The Hyperfinite II1 factor R 9 3. Projections, Type Classification, and Traces 10 3.1. Projections and the spectral theorem 10 3.2. Type classification of factors 12 3.3. Traces 13 4. Tracial ultrapowe...
متن کاملModel Theoretic Reformulation of the Baum-connes and Farrell-jones Conjectures
The Isomorphism Conjectures are translated into the language of homotopical algebra, where they resemble Thomason’s descent theorems.
متن کامل